Entangled Parametric Hierarchies: Problems for an Overspecified Universal Grammar

Entangled Parametric Hierarchies: Problems for an Overspecified Universal Grammar

This study addresses the feasibility of the classical notion of parameter in linguistic theory from the perspective of parametric hierarchies. A novel program-based analysis is implemented in order to show certain empirical problems related to these hierarchies. The program was developed on the basis of an enriched data base spanning 23 contemporary and 5 ancient languages. The empirical issues...

Universal Grammar is a universal grammar

§

Instance compression of parametric problems and related hierarchies

We define instance compressibility ([13, 17]) for parametric problems in the classes PH and PSPACE. We observe that the problem ΣiCIRCUITSAT of deciding satisfiability of a quantified Boolean circuit with i−1 alternations of quantifiers starting with an existential quantifier is complete for parametric problems in the class Σ i with respect to w-reductions, and that analogously the problem QBCS...

Lower semicontinuity for parametric set-valued vector equilibrium-like problems

A concept of weak $f$-property for a set-valued mapping is introduced‎, ‎and then under some suitable assumptions‎, ‎which do not involve any information‎ ‎about the solution set‎, ‎the lower semicontinuity of the solution mapping to‎ ‎the parametric‎ ‎set-valued vector equilibrium-like problems are derived by using a density result and scalarization method‎, ‎where the‎ ‎constraint set $K$...

Revisiting Universal Grammar 1